Planning for Machining Workpieces with a Partial-Order, Nonlinear Planner
نویسنده
چکیده
We describe a hybrid architecture supporting planning for machining workpieces. The architecture is built around CAPLAN, a partial-order nonlinear planner that represents the plan already generated and allows external control decision made by special purpose programs or by the user. To make planning more efficient, the domain is hierarchically modelled. Based on this hierarchical representation, a case-based control component has been realized that allows incremental acquisition of control knowledge by storing solved problems and reusing them in similar situations.
منابع مشابه
Advantages of Types in Partial-Order Planning
This paper shows an approach to proot from type information about planning objects in a partial-order planner. The approach turns out to combine representational and computational advantages. On the one hand, type hierarchies allow better struc-turing of domain speciications. On the other hand, operators contain type constraints which reduce the search space of the planner as they partially ach...
متن کاملA Speci cation of the Domain of Process Planning : Properties , Problems and
This report presents the properties of a speciication of the domain of process planning for rotary symmetrical workpieces. The speciication results from a model for problem solving in this domain that involves diierent reasoners, one of which is an AI planner that achieves goals corresponding to machining workpieces by considering certain operational restrictions of the domain. When planning wi...
متن کاملPartial - Order Planning : Evaluating Possible E ciency
Although most people believe that planners that delay step-ordering decisions as long as possible are more eecient than those that manipulate totally ordered sequences of actions, this intuition has received little formal justii-cation or empirical validation. In this paper we do both, characterizing the types of domains that ooer performance diierentiation and the features that distinguish the...
متن کاملCompiling Task Networks into Partial Order Planning Domains
This paper presents theoretical results and techniques for representing and managing task network goals in the framework of partial order planning. Task oriented formalisms are more expressive than partial order based formalism for problem goals in dynamical and changing domains, but they are not more powerful. We prove that it is always possible to express a task network problem in terms of an...
متن کاملPartial-Order Planning: Evaluating Possible E ciency Gains
Although most people believe that planners that delay step-ordering decisions as long as possible are more e cient than those that manipulate totally ordered sequences of actions, this intuition has received little formal justi cation or empirical validation. In this paper we do both, characterizing the types of domains that o er performance di erentiation and the features that distinguish the ...
متن کامل